Pascal Seeding and the Efficient Calculation of Sparse Jacobian Matrices ∗ ( Extended Abstract )
نویسندگان
چکیده
An elimination procedure based on Schur complement calculation is proposed for restoring the nonzero elements of a sparse Jacobian matrix. We provide a sparsity usage parameter that can be specified by users to tune the cost of matrix-vector product calculation and the cost of restoration of the nonzero entries. We employ Pascal seeding to compress the Jacobian matrix. Preliminary numerical test results are promising.
منابع مشابه
On Symbolic Jacobian Accumulation
Abstract: Derivatives are essential ingredients of a wide range of numerical algorithms. We focus on the accumulation of Jacobian matrices by Gaussian elimination on a sparse implementation of the extended Jacobian. A symbolic algorithm is proposed to determine the fill-in. Its runtime undercuts that of the original accumulation algorithm by a factor of ten. On the given computer architecture w...
متن کاملThe Efficient Computation of Sparse Jacobian Matrices Using Automatic Differentiation
This paper is concerned with the efficient computation of sparse Jacobian matrices of nonlinear vector maps using automatic differentiation (AD). Specifically, we propose the use of a graph coloring technique, bicoloring, to exploit the sparsity of the Jacobian matrix J and thereby allow for the efficient determination of J using AD software. We analyze both a direct scheme and a substitution p...
متن کاملMore about measures and Jacobians of singular random matrices
In this work are studied the Jacobians of certain singular transformations and the corresponding measures which support the jacobian computations.
متن کاملCalculation of One-dimensional Forward Modelling of Helicopter-borne Electromagnetic Data and a Sensitivity Matrix Using Fast Hankel Transforms
The helicopter-borne electromagnetic (HEM) frequency-domain exploration method is an airborne electromagnetic (AEM) technique that is widely used for vast and rough areas for resistivity imaging. The vast amount of digitized data flowing from the HEM method requires an efficient and accurate inversion algorithm. Generally, the inverse modelling of HEM data in the first step requires a precise a...
متن کاملReducing the Number of AD Passes for Computing a Sparse Jacobian Matrix
ABSTRACT A reduction in the computational work is possible if we do not require that the nonzeros of a Jacobian matrix be determined directly. If a column or row partition is available, the proposed substitution technique can be used to reduce the number of groups in the partition further. In this chapter, we present a substitution method to determine the structure of sparse Jacobian matrices e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004